An Adaptive Binary Arithmetic Coder Using a State Transition Table

We propose a fast and simple binary arithmetic coder, STT-coder, in which arithmetic operation of dividing the probability interval can be done using a state transition table. In order to simplify the state transition table by omitting to retain the both of the bottom address of the valid interval and renormalized interval, renormalization is mostly executed together with the flush operation of the register. For the prevention of the loss of the coding efficiency caused by flushing, the MPS/LPS interval to be renormalized is further divided into subintervals having no code space loss in flushing, by assigning them the combination of the current and succeeding symbols. We then propose an adaptive control method of probability estimation in STT-coder for unknown or non-stationary information sources. The probability estimation is also executed based on another state transition table to simplify the operation. In this paper, we describe the concept of STT-coder taking the case of quite short register size, and evaluate its coding efficiency compared with well-known MQ-coder. We further introduce out study to extend the register size in order to improve the performance of STT-coder for high MPS probability sources.